Complex Orthogonal Designs with Forbidden 2 × 2 Submatrices
نویسندگان
چکیده
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| )In×n. Define Oz an M-type COD if and only if Oz does not contain submatrix (
منابع مشابه
Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| )In×n. Define Oz a first type COD if and only if Oz does not contain submatrix (
متن کاملAmicable complex orthogonal designs
In this letter, we define amicable complex orthogonal designs (ACOD) and propose two systematic methods to construct higher-order ACOD’s from lower-order ACOD’s. Although the upper bound on the number of variables of ACOD’s is found to be the same as that of amicable orthogonal designs (AOD), we show that certain types of AOD’s that were previously shown to be non-existent or undecided, such as...
متن کاملRecognizing Balanceable Matrices
A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/ ± 1 matrices and balanceable ...
متن کاملA Class of Maximal-Rate, Low-PAPR, Non-square Complex Orthogonal Designs
Space-time block codes (STBCs) from non-square complex orthogonal designs are bandwidth efficient when compared with those from square real/complex orthogonal designs. Though there exists rate-1 ROD for any number of transmit antennas, rate-1 complex orthogonal designs (COD) does not exist for more than 2 transmit antennas. Liang (IEEE Trans. Inform. Theory, 2003) and Lu et al (IEEE Trans. Info...
متن کاملOn Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a lineartime algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal forbidden submatrices of matrices that do not have the consecutive-ones property. We give a linear-time algorithm to find one in any matrix that does not have the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 58 شماره
صفحات -
تاریخ انتشار 2012